Conjunctive Grammars and Alternating Pushdown Automata Draft Paper
نویسندگان
چکیده
In this paper we introduce a variant of alternating pushdown automata, Synchronized Alternating Pushdown Automata, which accept the same class of languages as those generated by conjunctive grammars.
منابع مشابه
Linear Conjunctive Grammars and One-Turn Synchronized Alternating Pushdown Automata
In this paper we introduce a sub-family of synchronized alternating pushdown automata, one-turn Synchronized Alternating Pushdown Automata, which accept the same class of languages as those generated by Linear Conjunctive Grammars. This equivalence is analogues to the classical equivalence between one-turn PDA and Linear Grammars, thus strengthening the claim of Synchronized Alternating Pushdow...
متن کاملInput-driven languages are linear conjunctive
Linear conjunctive grammars define the same family of languages as one-way real-time cellular automata (A. Okhotin, “On the equivalence of linear conjunctive grammars to trellis automata”, RAIRO ITA, 2004), and this family is known to be incomparable with the context-free languages (V. Terrier, “On real-time one-way cellular array”, Theoret. Comput. Sci., 1995). This paper demonstrates the cont...
متن کاملOn Alternating Non-Context-Free Grammars
We study several extensions of the notion of alternation from context-free grammars to context-sensitive and arbitrary phrase-structure grammars. Thereby new grammatical characterizations are obtained for the class of languages that are accepted by alternating pushdown automata.
متن کاملOn state-alternating context-free grammars
The state-alternating context-free grammars are introduced, and the language classes obtained from them are compared to the classes of the Chomsky hierarchy as well as to some well-known complexity classes. In particular, the state-alternating context-free grammars are compared to the alternating context-free grammars of Moriya (1989) and to the alternating pushdown automata. Further, various d...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کامل